Complexity characterizations of attribute grammar languages

نویسندگان

  • Sophocles Ephremidis
  • Christos H. Papadimitriou
  • Martha Sideri
چکیده

Attribute grammars were introduced by Knuth as a mechanism for specifying the semantics of context-free languages (Knuth, 1968). Almost two decades after their introduction, they remain one of the main techniques for specifying semantics of programming languages, and have recently been used in new and quite diverse domains. An attribute grammar is a context-free grammar, in which each nonterminal has been endowed with certain attributes which can take values. Each production is enriched with functions whereby one can compute the values of attributes of nonterminals involved in the production in terms of the values of other such attributes. Also, there may be a predicate associated with a production, specifying that a particular relation must hold between the values of the various attributes. Attribute grammers are usually viewed as translations from strings in the underlying context-free language to attribute values (in the programming language application, from programs to executable code). Recently, it was shown (Engelfriet, 1986) that the ranges of such mappings constitute all languages log-tape reducible to the context-free languages, if we assume that the attribute computations involve only string concatenation (as it is natural to do in the context of compilation). However, it is also useful and instructive to study attribute grammars as language generators, since in many applications of attribute grammars, parsing is the main interest. An atribute grammar AG generates the language consisting of all strings that have a legal parse tree in AG (that is, a parse tree in which all attribute values relate in the prescribed way). Because of the predicates, a parse tree of the original context-free grammar may no longer be a legal parse tree of the attribute grammar, and thus the language accepted by an attribute grammar is in general a subset of the corresponding context-free language. It is clear that any context-free language can be generated by an attribute

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Universal Grammar and Chaos/Complexity Theory: Where Do They Meet And Where Do They Cross?

  Abstract The present study begins by sketching "Chaos/Complexity Theory" (C/CT) and its applica-tion to the nature of language and language acquisition. Then, the theory of "Universal Grammar" (UG) is explicated with an eye to C/CT. Firstly, it is revealed that CCT may or may not be allied with a theory of language acquisition that takes UG as the initial state of language acquisition for ...

متن کامل

Debugger for Attribute Grammar Specification Language , Silver

Despite the growth of information technology, it has not provided satisfactory results in certain areas. This is because our current approach has been limited by time consuming processes of software testing and software development.Programming,specially declarative and functional, can improve this methodology by making programmers free from following certain sequence of expression calculation. ...

متن کامل

On the Generating Power of Deterministic Tree Transducers

Attributed tree transducers are abstract models to study properties of attribute grammars. One abstraction which occurs when modeling attribute grammars by attributed tree transducers is that arbitrary trees over a ranked alphabet are taken as input, instead of derivation trees of a context{free grammar. In this paper we show that with respect to the generating power this is not an abstraction,...

متن کامل

Interpreting Compounds For Machine Translation

The paper presents a procedure for interpretation of English compounds and lkn" automatic translation of such compounds into Slavic languages and French. In tile target languages, a compound nominal is as a role to be rendered by an NP with an adjective or genitive attribute, or with an attrilmtive participle construction. The model is based on Bierwisch's theory of word formation, which in tur...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Inf. Comput.

دوره 78  شماره 

صفحات  -

تاریخ انتشار 1987